Reconstructibility of Matroid Polytopes
نویسندگان
چکیده
We specify what is meant for a polytope to be reconstructible from its graph or dual graph, and we introduce the problem of class reconstructibility; i.e., face lattice can determined (dual) within given class. provide examples cubical polytopes that are not their graphs. Furthermore, show matroid (base) graphs graphs; our counterexamples include hypersimplices. Additionally, prove graphs, present an $O(n^3)$ algorithm computes vertices $n$-vertex graph. Moreover, proof includes characterization all matroids with isomorphic basis exchange
منابع مشابه
Coxeter matroid polytopes
If ∆ is a polytope in real affine space, each edge of ∆ determines a reflection in the perpendicular bisector of the edge. The exchange group W (∆) is the group generated by these reflections, and ∆ is a (Coxeter) matroid polytope if this group is finite. This simple concept of matroid polytope turns out to be an equivalent way to define Coxeter matroids. The GelfandSerganova Theorem and the st...
متن کاملLattice Path Matroid Polytopes
Fix two lattice paths P and Q from (0, 0) to (m, r) that use East and North steps with P never going above Q. Bonin et al. in [1] show that the lattice paths that go from (0, 0) to (m, r) and remain bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call it a lattice path matroid. In this paper, we consider properties of lattice path matroi...
متن کاملKalai Orientations on Matroid Polytopes
Let P a polytope and let G(P ) be the graph of P . Following Gil Kalai, we say that an acyclic orientation O of G(P ) is good if, for every non-empty face F of P , the induced graph G(F ) has exactly one sink. Gil Kalai gave a simple way to tell a simple polytope from the good orientations of its graph. This article is a broader study of “good orientations” (of the graphs) on matroid polytopes....
متن کاملMatroid Polytopes and their Volumes
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian Grk,n. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of M . Our proofs are based on a natural...
متن کاملEhrhart Polynomials of Matroid Polytopes and Polymatroids
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2022
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/21m1401176